Matrix-product structure of repeated-root constacyclic codes over finite fields
نویسندگان
چکیده
For any prime number p, positive integers m, k, n satisfying gcd(p, n) = 1 and λ0 ∈ F × pm, we prove that any λ p 0 -constacyclic code of length p n over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of p λ0-constacyclic codes with length n over Fpm.
منابع مشابه
On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
In this paper we investigate the structure of repeated root constacyclic codes of length 2mp over Fps with a ≥ 1 and (m, p) = 1. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.
متن کاملRepeated-root constacyclic codes of length slmpn
For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.
متن کاملMatrix-product structure of constacyclic codes over finite chain rings $\mathbb{F}_{p^m}[u]/\langle u^e\rangle$
Let m, e be positive integers, p a prime number, Fpm be a finite field of p elements and R = Fpm [u]/〈u 〉 which is a finite chain ring. For any ω ∈ R and positive integers k, n satisfying gcd(p, n) = 1, we prove that any (1+ωu)-constacyclic code of length pn over R is monomially equivalent to a matrix-product code of a nested sequence of p cyclic codes with length n over R and a p × p matrix Ap...
متن کاملPolycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملRepeated-root constacyclic codes of length $2\ell^mp^n$
For any different odd primes l and p, structure of constacyclic codes of length 2lp over a finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length 2lp over Fq are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.08819 شماره
صفحات -
تاریخ انتشار 2017